A Nonoverlapping Subdomain Algorithm with Lagrange Multipliers and its Object Oriented Implementation for Interface Problems

نویسندگان

  • Daoqi Yang
  • DAOQI YANG
چکیده

A parallel nonoverlapping subdomain Schwarz alternating algorithm with Lagrange multipliers and interface relaxation is proposed for linear elliptic interface problems with discontinuities in the solution, its derivatives, and the coefficients. New features of the algorithm include that Lagrange multipliers are introduced on the interface and that it is used to solve equations with discontinuous solution. These equations have important applications to alloy solidification problems [1] and immiscible flow of fluids with different densities and viscosities and surface tension. They do not fit into the Schwarz preconditioning and Schur complement frameworks since the solution is not in H(Ω), but is piecewise in H(Ω), where Ω is the physical domain on which the differential equations are defined. An expression for the optimal interface relaxation parameters is also given. Numerical experiments are conducted for a piecewise linear triangular finite element discretization in object oriented paradigm using C++. In this implementation, the class for subdomain solvers inherits from the class for grid triangulation and contains type bound procedures for forming stiffness matrices and solving linear systems. From software engineering point of view, features like encapsulation, inheritance, polymorphism and dynamic binding, make such domain decomposition algorithms an ideal application area of object oriented programming. The organization of this work is as follows. In Section 2, the domain decomposition method is described for general elliptic interface problems. In Section 3, a finite element approximation with Lagrange multipliers is considered. Then in Section 4, some implementation issues using object oriented techniques in C++ are discussed. Finally in Section 5, numerical examples are provided to check the performance of the method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Nonoverlapping Schwarz Domain Decomposition Method for Elliptic Interface Problems

We present a parallel nonoverlapping Schwarz domain decomposition method with interface relaxation for linear elliptic problems, possibly with discontinuities in the solution and its derivatives. This domain decomposition method can be characterized as: the transmission conditions at the interface of subdomains are taken to be Dirichlet at odd iterations and Neumann at even iterations. The conv...

متن کامل

A Nonoverlapping Domain Decomposition Method for Incompressible Stokes Equations with Continuous Pressures

A non-overlapping domain decomposition algorithm is proposed to solve the linear system arising from mixed finite element approximation of incompressible Stokes equations. A continuous finite element space for the pressure is used. In the proposed algorithm, Lagrange multipliers are used to enforce continuity of the velocity component across the subdomain boundary. The continuity of the pressur...

متن کامل

A Dual-Primal FETI method for incompressible Stokes equations

In this paper, a dual-primal FETI method is developed for incompressible Stokes equations approximated by mixed nite elements with discontinuous pressures. The domain of the problem is decomposed into nonoverlapping subdomains, and the continuity of the velocity across the subdomain interface is enforced by introducing Lagrange multipliers. By a Schur complement procedure, solving the inde nite...

متن کامل

SCHRIFTENREIHE DES FACHBEREICHS MATHEMATIK A Parallel Implementation of Dual-Primal FETI Methods for Three Dimensional Linear Elasticity Using a Transformation of Basis by

Dual-primal FETI methods for linear elasticity problems in three dimensions are considered. These are nonoverlapping domain decomposition methods where some primal continuity constraints across subdomain boundaries are required to hold throughout the iterations, whereas most of the constraints are enforced by Lagrange multipliers. An algorithmic framework for dualprimal FETI methods is describe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998